Generalized Split Graphs and Ramsey Numbers
نویسندگان
چکیده
منابع مشابه
Generalized Split Graphs and Ramsey Numbers
A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown that for fixed p, q, ( p, q)-split graphs can be characterized by excluding a finite set of forbidd...
متن کاملAnti-Ramsey numbers in complete split graphs
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...
متن کاملOn generalized Ramsey numbers
Let f1 and f2 be graph parameters. The Ramsey number r(f1 ≥ m; f2 ≥ n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) ≥ m or f2(G) ≥ n. A general existence condition is given and a general upper bound is shown in this paper. In addition, suppose the number of triangles in G is denoted by t(G). We verify that (1− o(1))(24n) ≤ r(t ≥ n; t ≥ n) ≤ (1 + o(1))(48...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملRamsey numbers of degenerate graphs
A graph is d-degenerate if all its subgraphs have a vertex of degree at most d. We prove that there exists a constant c such that for all natural numbers d and r, every d-degenerate graph G of chromatic number r has Ramsey number at most 2 cr |V (G)|. This solves a conjecture of Burr and Erdős from 1973.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1998
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2833